Results on Total Restrained Domination in Graphs
نویسندگان
چکیده
Let G = (V,E) be a graph. A set S ⊆ V (G) is a total restrained dominating set if every vertex of G is adjacent to a vertex in S and every vertex of V (G)\S is adjacent to a vertex in V (G)\S. The total restrained domination number of G, denoted by γtr(G), is the smallest cardinality of a total restrained dominating set of G. In this paper we continue the study of total restrained domination in graphs and obtain some new results. Mathematics Subject Classification: 05C69
منابع مشابه
$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملOn Roman, Global and Restrained Domination in Graphs
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total restrained domination numbers for large classes of graphs, and show that, for almost all graphs, the restrained domination number is equal to the domination num...
متن کاملResults on Total Domination and Total Restrained Domination in Grid Graphs
A set S of vertices in a graph G(V,E) is called a total dominating set if every vertex v ∈ V is adjacent to an element of S. A set S of vertices in a graph G(V,E) is called a total restrained dominating set if every vertex v ∈ V is adjacent to an element of S and every vertex of V − S is adjacent to a vertex in V − S. The total domination number of a graph G denoted by γt(G) is the minimum card...
متن کاملOn the total restrained domination edge critical graphs
Let G = (V, E) be a graph. A set D ⊆ V is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in V −D has a neighbor in V −D. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number of G. In this paper, we define the concept of total restrained domination edge critical graphs, find a lower bound for...
متن کاملCharacterization of total restrained domination edge critical unicyclic graphs
A graph with no isolated vertices is edge critical with respect to total restrained domination if for any non-edge e of G, the total restrained domination number of G+ e is less than the total restrained domination number of G. We call these graphs γtr-edge critical. In this paper, we characterize all γtr-edge critical unicyclic graphs.
متن کامل